S(b)-Trees: An Optimal Balancing of Variable Length Keys
نویسنده
چکیده
The paper studies the problem of maintaining external dynamic dictionaries with variable length keys. We introduce a new type of balanced trees, called S(b)-trees, which generalize traditional B-trees. Contrary to B-trees S(b)-trees provide optimal utilization of keys of variable length, while the data access time remains logarithmical, the same as for B-trees. The main property of the new trees is their local incompressibility. That is, any sequence consisting of b + 1 neighboring nodes of the tree cannot be compressed into a b well formed nodes. We prove 1 − ε utilization lower bound for these trees where ε is inversely proportional to the tree branching. Logarithmic running time algorithms for search, insertion, and deletion are presented. The data structure is a flexible storage solution for semi-structured data and XML databases.
منابع مشابه
B-slack trees: Highly Space Efficient B-trees
B-slack trees, a subclass of B-trees that have substantially better worst-case space complexity, are introduced. They store n keys in height O(logb n), where b is the maximum node degree. Updates can be performed in O(log b 2 n) amortized time. A relaxed balance version, which is well suited for concurrent implementation, is also presented.
متن کاملB-slack Trees: Space Efficient B-Trees
B-slack trees, a subclass of B-trees that have substantially better worst-case space complexity, are introduced. They store n keys in height O(logb n), where b is the maximum node degree. Updates can be performed in O(log b 2 n) amortized time. A relaxed balance version, which is well suited for concurrent implementation, is also presented.
متن کاملOptimal Region for Binary Search Tree, Rotation and Polytope
Given a set of keys and its weight, a binary search tree(BST) with the smallest path length among all trees with the keys and the weight is called optimal tree. Knuth showed that the optimal tree is computed in the time of square of the number of keys. In this paper, we propose algorithms that divide the weight space into regions corresponding to optimal trees by a construction algorithm of con...
متن کاملConstruction of Nearly Optimal Multiway Trees
In this paper, the construction of nearly optimal multiway trees for n keys, n key weights, and n + 1 gap weights, is investigated. we present an efficient algorithm for this problem having a time complexity of O(H tn), where H is the height of the resulting tree and t is its order. The algorithm is based on a top down approach. For a given set of keys, we determine a subset of keys that should...
متن کامل